Interpolation on Sparse Gauss-Chebyshev Grids in Higher Dimensions
نویسندگان
چکیده
In this paper, we give a unified approach to error estimates for interpolation on sparse Gauß–Chebyshev grids for multivariate functions from Besov–type spaces with dominating mixed smoothness properties. The error bounds obtained for this method are almost optimal for the considered scale of function spaces. 1991 Mathematics Subject Classification: 41A05, 41A63, 65D05, 46E35
منابع مشابه
High dimensional polynomial interpolation on sparse grids
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...
متن کاملThe Sparse Grid Interpolant
Smolyak’s sparse grid construction is commonly used in a setting involving quadrature of a function of a multidimensional argument over a product region. However, the method can be applied in a straightforward way to the interpolation problem as well. In this discussion, we outline a procedure that begins with a family of interpolants defined on a family of nested tensor product grids, and demo...
متن کاملA Nodal Sparse Grid Spectral Element Method for Multi-Dimensional Elliptic Partial Differential Equations
We develop a sparse grid spectral element method using nodal bases on Chebyshev-Gauss-Lobatto points for multi-dimensional elliptic equations. Since the quadratures based on sparse grid points do not have the accuracy of a usual Gauss quadrature, we construct the mass and stiffness matrices using a pseudo-spectral approach, which is exact for problems with constant coefficients and uniformly st...
متن کاملAiaa 98–0133 Compressible Navier-stokes Computations on Unstruc- Tured Quadrilateral Grids by a Staggered-grid Chebyshev Method
We describe a new spectral multidomain method for the solution of the compressible Navier-Stokes equations. Within each subdomain, the method collocates the solution unknowns and the gradients at the nodes of the Gauss-Chebyshev quadrature. The total fluxes are evaluated at the nodes of the Gauss-Lobatto quadrature. Both conforming and non-conforming subdomain grids are allowed. Two examples ar...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کامل